Improving Graph-based methods for computing qualitative properties of markov decision processes
نویسندگان
چکیده
منابع مشابه
Learning Qualitative Markov Decision Processes Learning Qualitative Markov Decision Processes
To navigate in natural environments, a robot must decide the best action to take according to its current situation and goal, a problem that can be represented as a Markov Decision Process (MDP). In general, it is assumed that a reasonable state representation and transition model can be provided by the user to the system. When dealing with complex domains, however, it is not always easy or pos...
متن کاملMethods for Computing State Similarity in Markov Decision Processes
A popular approach to solving large probabilistic systems relies on aggregating states based on a measure of similarity. Many approaches in the literature are heuristic. A number of recent methods rely instead on metrics based on the notion of bisimulation, or behavioral equivalence between states (Givan et al., 2003; Ferns et al., 2004). An integral component of such metrics is the Kantorovich...
متن کاملmodification of nanoclay for improving the physico-mechanical properties of dental adhesives
هدف اصلی این مطالعه تهیه یک سامانه نوین چسب عاجی دندانی بر پایه نانورس پیوند شده با پلی متاکریلیک اسید، نانورس پیوند شده با پلی اکریلیک اسید، مخلوط نانوسیلیکا و نانورس پیوند شده با پلی متاکریلیک اسید، مخلوط نانوسیلیکا و نانورس پیوند شده با پلی اکریلیک اسید و نانورس پیوند شده با کیتوسان اصلاح شده با گلایسیدیل متاکریلات است. پیوند پلی متاکریلیک اسید و پلی اکریلیک اسید بر ری سطح نانورس در حضور و ...
Incremental methods for computing Markov decision
Partially observable M arkov decision processes (POMDPS) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect observability. The control problem is formulated as a dynamic optimization problem with a value function combining costs or rewards from multiple steps. In this paper we propose, analyse and test various incremental m...
متن کاملInterval Methods for Uncertain Markov Decision Processes
In this paper, the average cases of Markov decision processes with uncertainty is considered. That is, a controlled Markov set-chain model with a finite state and action space is developed by an interval arithmetic analysis, and we will find a Pareto optimal policy which maximizes the average expected rewards over all stationary policies under a new partial order. The Pareto optimal policies is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indonesian Journal of Electrical Engineering and Computer Science
سال: 2020
ISSN: 2502-4760,2502-4752
DOI: 10.11591/ijeecs.v17.i3.pp1571-1577